An RLL code design that maximises channel utilisation
نویسندگان
چکیده
منابع مشابه
LDPC Code-Design for the Relay Channel
We propose LDPC code designs for the half-duplex relay channel. Our designs are derived from the information theoretic random coding scheme for decode-and-forward relaying. An important advantage of our scheme is that it is built entirely of single-user codes. The optimization of relay LDPC code profiles presents unique challenges, which are met by modifying the density evolution algorithm by i...
متن کاملProbability Distributions for Channel Utilisation
Sensor nets have many undisputed fields of application. A paradigm of communication is the use of one control channel in the MAC layer. We challenge this paradigm for nodes with very restricted hardware resources. In our model nodes support the use of different channels and use clock synchronisation. We present a simple probabilistic synchronised channel utilisation scheme for wireless communic...
متن کاملLDPC Code Design for Relay Channel in Time-Division mode
We address the problem of LDPC code design for relay channel in time-division mode based on a distributed strategy: In the first time slot, the source transmits part of the codeword. The relay and the destination receive it but only the relay can decode it. In the second time slot, the relay transmits the additional redundant bits to the destination. The destination is able to decode the transm...
متن کاملSide channel parameter characteristics of code injection attacks
Embedded systems are suggestive targets for code injection attacks in the recent years. Software protection mechanisms, and in general computers, are not usually applicable in embedded systems since they have limited resources like memory and process power. In this paper we investigate side channel characteristics of embedded systems and their applicability in code injection attack detection. T...
متن کاملThe Feedback Capacity of the $(1,\infty)$-RLL Input-Constrained Erasure Channel
The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1,∞)-RLL constraint. We derive the capacity for this setting, which can be expressed as Cǫ = max0≤p≤ 1 2 Hb(p) p+ 1 1−ǫ , where ǫ is the erasure probability and Hb(·) is the binary entropy function. Moreover, we prove that a-priori knowledge of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Reasoning-based Intelligent Systems
سال: 2013
ISSN: 1755-0556,1755-0564
DOI: 10.1504/ijris.2013.055128